Nuprl Lemma : rel_plus_strongwellfounded 11,40

T:Type, R:(TTprop{i:l}). SWellFounded(x R y SWellFounded(x rel_plus(TRy
latex


Definitionsx:AB(x), prop{i:l}, P  Q, SWellFounded(R(x;y)), x f y, x:AB(x), , t  T, A  B, A, False, sq_type(T), guard(T), rel_exp(TRn), Y, if b then t else f fi , tt, ff, P  Q, rel_plus(TR), , decidable(P), P  Q, (i = j), , Unit, P  Q,
Lemmasnat plus properties, nat wf, rel exp wf, le wf, decidable int equal, nat plus wf, rel plus wf, eq int wf, bool wf, iff transitivity, assert wf, eqtt to assert, assert of eq int, bnot wf, not wf, eqff to assert, assert of bnot, not functionality wrt iff

origin